Centralizers of reflections and reflection-independence of Coxeter groups
نویسنده
چکیده
A Coxeter group W is called reflection independent if its reflections are uniquely determined by W only, independently on the choice of the generating set. We give a new sufficient condition for the reflection independence, and examine this condition for Coxeter groups in certain classes, possibly of infinite ranks. We also determine the finite irreducible components of another Coxeter group, that is a subgroup of W generated by the reflections centralizing a given generator of W . Determining such a subgroup makes our criterion efficient.
منابع مشابه
Reflection Centralizers in Coxeter Groups
We give a new proof of Brink’s theorem that the nonreflection part of a reflection centralizer in a Coxeter group is free, and make several refinements. In particular we give an explicit finite set of generators for the centralizer and a method for computing the Coxeter diagram for its reflection part. In many cases, our method allows one to compute centralizers quickly in one’s head. We also d...
متن کاملBounding Reflection Length in an Affine Coxeter Group
In any Coxeter group, the conjugates of elements in the standard minimal generating set are called reflections and the minimal number of reflections needed to factor a particular element is called its reflection length. In this article we prove that the reflection length function on an affine Coxeter group has a uniform upper bound. More precisely we prove that the reflection length function on...
متن کاملOn Coxeter Diagrams of complex reflection groups
We study complex Coxeter diagrams of some unitary reflection groups. Using solely the combinatorics of diagrams, we give a new proof of the classification of root lattices defined over E = Z[e2πi/3]: there are only four such lattices, namely, the E–lattices whose real forms are A2, D4, E6 and E8. Next, we address the issue of characterizing the diagrams for unitary reflection groups, a question...
متن کاملReflection subgroups of odd-angled Coxeter groups
We give a criterion for a finitely generated odd-angled Coxeter group to have a proper finite index subgroup generated by reflections. The answer is given in terms of the least prime divisors of the exponents of the Coxeter relations.
متن کاملA Refined Count of Coxeter Element Reflection Factorizations
For well-generated complex reflection groups, Chapuy and Stump gave a simple product for a generating function counting reflection factorizations of a Coxeter element by their length. This is refined here to record the number of reflections used from each orbit of hyperplanes. The proof is case-by-case via the classification of well-generated groups. It implies a new expression for the Coxeter ...
متن کامل